A Novel Direct Relational Heuristic Algorithm of Possibilistic Clustering
نویسندگان
چکیده
منابع مشابه
On relational possibilistic clustering
This paper initially describes the relational counterpart of possibilistic c-means (PCM) algorithm, called relational PCM (or RPCM). RPCM is then improved to better handle arbitrary dissimilarity data. First, a re-scaling of the PCM membership function is proposed in order to obtain zero membership values when the distance to prototype equals the maximum value allowed in bounded dissimilarity m...
متن کاملIntuitionistic Heuristic Prototype-based Algorithm of Possibilistic Clustering
This paper introduces a novel intuitionistic fuzzy set-based heuristic algorithm of possibilistic clustering. For the purpose, some remarks on the fuzzy approach to clustering are discussed and a brief review of intuitionistic fuzzy set-based clustering procedures is given, basic concepts of the intuitionistic fuzzy set theory and the intuitionistic fuzzy generalization of the heuristic approac...
متن کاملA NOVEL META-HEURISTIC ALGORITHM: TUG OF WAR OPTIMIZATION
This paper presents a novel population-based meta-heuristic algorithm inspired by the game of tug of war. Utilizing a sport metaphor the algorithm, denoted as Tug of War Optimization (TWO), considers each candidate solution as a team participating in a series of rope pulling competitions. The teams exert pulling forces on each other...
متن کاملA Heuristic Possibilistic Approach to Clustering for Asymmetric Data
This paper deals with the problem of clustering of asymmetric data. A method of the problem solving is based on the application of a direct possibilistic clustering algorithm based on the concept of allotment among fuzzy cluster to a matrix of fuzzy tolerance, which correspond to the set of objects, for which asymmetric distances or proximities hold. The paper provides the description of the me...
متن کاملA Heuristic Approach to Possibilistic Clustering for Fuzzy Data
The paper deals with the problem of the fuzzy data clustering. In other words, objects attributes can be represented by fuzzy numbers or fuzzy intervals. A direct algorithm of possibilistic clustering is the basis of an approach to the fuzzy data clustering. The paper provides the basic ideas of the method of clustering and a plan of the direct possibilistic clustering algorithm. Definitions of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/18850-0381